A Note on Squares in Binary Words
نویسندگان
چکیده
We consider words over a binary alphabet. A word [Formula: see text] is overlap-free if it does not have factors (blocks of consecutive letters) the form for nonempty text]. Let denote number positions that are middle squares (of text]) in show words, text], and there infinitely many which
منابع مشابه
On Weak Circular Squares in Binary Words
A weak square in a binary word is a pair of adjacent non-empty blocks of the same length, having the same number of 1s. A weak circular square is a weak square which is possibly wrapped around the word: the tail protruding from the right end of the word reappears at the left end. Two weak circular squares are equivalent if they have the same length and contain the same number of ones. We prove ...
متن کاملSquares in Binary Partial Words
In this paper, we investigate the number of positions that do not start a square, the number of square occurrences, and the number of distinct squares in binary partial words. Letting σh(n) be the maximum number of positions not starting a square for binary partial words with h holes of length n, we show that limσh(n)/n = 15/31 provided the limit of h/n is zero. Letting γh(n) be the minimum num...
متن کاملBinary Words with Few Squares
A short proof is given for a result of Fraenkel and Simpson [Electronic J. Combinatorics 2 (1995), 159–164] stating that there exists an infinite binary word which has only three different squares u.
متن کاملAvoiding large squares in infinite binary words
We consider three aspects of avoiding large squares in infinite binary words. First, we construct an infinite binary word avoiding both cubes xxx and squares yy with |y| ≥ 4; our construction is somewhat simpler than the original construction of Dekking. Second, we construct an infinite binary word avoiding all squares except 0, 1, and (01); our construction is somewhat simpler than the origina...
متن کاملCubefree binary words avoiding long squares
Entringer, Jackson, and Schatz conjectured in 1974 that every infinite cubefree binary word contains arbitrarily long squares. In this paper we show this conjecture is false: there exist infinite cubefree binary words avoiding all squares xx with |x| ≥ 4, and the number 4 is best possible. However, the Entringer-Jackson-Schatz conjecture is true if “cubefree” is replaced with “overlap-free”.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2023
ISSN: ['1793-6373', '0129-0541']
DOI: https://doi.org/10.1142/s0129054123480052